Empirical comparison of dependency conversions for RST discourse trees
نویسندگان
چکیده
Two heuristic rules that transform Rhetorical Structure Theory discourse trees into discourse dependency trees (DDTs) have recently been proposed (Hirao et al., 2013; Li et al., 2014), but these rules derive significantly different DDTs because their conversion schemes on multinuclear relations are not identical. This paper reveals the difference among DDT formats with respect to the following questions: (1) How complex are the formats from a dependency graph theoretic point of view? (2) Which formats are analyzed more accurately by automatic parsers? (3) Which are more suitable for text summarization task? Experimental results showed that Hirao’s conversion rule produces DDTs that are more useful for text summarization, even though it derives more complex dependency structures.
منابع مشابه
Rhetoric And Intentions In Discourse
On the face of it these theories are rather similar: both provide hierarchical characterisations of texts, and both seem concerned with the purpose of the text for GSDT, the text realizes the intentional structure that underlies it; and for R.ST, the text is structured in terms of the rhetorical relations that hold between its parts. But these similarities are only skin deep. The kinds of trees...
متن کاملExpressivity and comparison of models of discourse structure
Several discourse annotated corpora now exist for NLP. But they use different, not easily comparable annotation schemes: are the structures these schemes describe incompatible, incomparable, or do they share interpretations? In this paper, we relate three types of discourse annotation used in corpora or discourse parsing: (i) RST, (ii) SDRT, and (iii) dependency tree structures. We offer a comm...
متن کاملStrong generative capacity of RST, SDRT and discourse dependency DAGSs
The aim of this paper is to compare the discourse structures proposed in RST, SDRT and dependency DAGs which extend the semantic level of MTT for discourses. The key question is the following: do these formalisms allow the representation of all the discourse structures which correspond to felicitous discourses and exclude those which correspond to infelicitous discourses? Hence the term of “str...
متن کاملPlaying with RST: Two Algorithms for the Automated Manipulation of Discourse Trees
This paper presents two algorithms for modifying RST based discourse trees in order to solve two given problems. By only exploiting syntactic properties of the trees, information originally presented is reorganized, to produce new, coherent text.
متن کاملGenerating Ellipsis Using Discourse Structures
This article describes an effort to generate elliptic sentences, using Dependency Trees connected by Discourse Relations as input. We contend that the process of syntactic aggregation should be performed in the Surface Realization stage of the language generation process, and that Dependency Trees with Rhetorical Relations are excellent input for a generation system that has to generate ellipsi...
متن کامل